Sharpening Occam's razor

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharpening Occam's Razor

We provide a new representation-independent formulation of Occam’s razor theorem, based on Kolmogorov complexity. This new formulation allows us to: (i) Obtain better sample complexity than both length-based [4] and VC-based [3] versions of Occam’s razor theorem, in many applications; and (ii) Achieve a sharper reverse of Occam’s razor theorem than that of [5]. Specifically, we weaken the assum...

متن کامل

Occam's Razor

The Bayesian paradigm apparently only sometimes gives rise to Occam’s Razor; at other times very large models perform well. We give simple examples of both kinds of behaviour. The two views are reconciled when measuring complexity of functions, rather than of the machinery used to implement them. We analyze the complexity of functions for some linear in the parameter models that are equivalent ...

متن کامل

Portfolio Sharpening

We explore the effective gain or loss in alpha from the point of view of the investor due to the volatility of a fund and its correlations to other asset classes. Fund managers and investors can be guided by this to increase the utility that is ultimately delivered to the investor. In this analysis of investor utility the Sharpe ratio is shown to be misleading and the tracking error has no role...

متن کامل

Sharpening radiographs.

This article describes a method for clarifying and sharpening radiographs. The method uses convolution with a computed tomography reconstruction kernel and a noise elimination procedure to control the noise amplification of the convolution. The effect is to flatten global variations and to sharpen and magnify local variations. Examples from industry and medicine are included.

متن کامل

Extending Occam's Razor

Occam's Razor states that, all other things being equal, the simpler of two possible hypotheses is to be preferred. A quanti ed version of Occam's Razor has been proven for the PAC model of learning, giving sample-complexity bounds for learning using what Blumer et al. call an Occam algorithm [1]. We prove an analog of this result for Haussler's more general learning model, which encompasses le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2003

ISSN: 0020-0190

DOI: 10.1016/s0020-0190(02)00427-1